Computation of orders and cycle lengths of automorphisms of finite solvable groups

Let G be a finite solvable group, given through refined consistent polycyclic presentation, and α an automorphism of G, its images the generators G. In this paper, we discuss algorithms for computing order as well cycle length element under α. We give correctness proofs theoretical complexity these algorithms. Along way, carry out detailed analyses several classical on groups.